- pseudo-polynomial
- мат.псевдомногочлен
English-Russian scientific dictionary. 2008.
pseudo-polynomial
Смотреть что такое "pseudo-polynomial" в других словарях:
Pseudo-polynomial time — In computational complexity theory, a numeric algorithm runs in pseudo polynomial time if its running time is polynomial in the numeric value of the input (which is exponential in the length of the input its number of digits).An ExampleConsider… … Wikipedia
Pseudo-differential operator — In mathematical analysis a pseudo differential operator is an extension of the concept of differential operator. Pseudo differential operators are used extensively in the theory of partial differential equations and quantum field theory.… … Wikipedia
Pseudo algebraically closed field — In mathematics, a field K is pseudo algebraically closed (usually abbreviated by PAC) if one of the following equivalent conditions holds:*Each absolutely irreducible variety V defined over K has a K rational point. *Each absolutely irreducible… … Wikipedia
Pseudo-zero set — In complex analysis, the pseudo zero set or root neighborhood of a degree m polynomial p ( z ) is the set of all complex numbers that are roots of polynomials whose coefficients differ from ps by a small amount. Namely, given a norm |·| on… … Wikipedia
Quasi-polynomial — In mathematics, a quasi polynomial (pseudo polynomial) is a generalization of polynomials. While the coefficients of a polynomial come from a ring, the coefficients of quasi polynomials are instead periodic functions with integral period. Quasi… … Wikipedia
Primitive polynomial — In field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite extension field GF( p m ). In other words, a polynomial F(X) with coefficients in GF( p ) = Z/ p Z is a primitive… … Wikipedia
Knapsack problem — BKP redirects here. For other uses, see BKP (disambiguation). Example of a one dimensional (constraint) knapsack problem: which boxes should be chosen to maximize the amount of money while still keeping the overall weight under or equal to… … Wikipedia
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
Subset sum problem — In computer science, the subset sum problem is an important problem in complexity theory and cryptography. The problem is this: given a set of integers, does the sum of some non empty subset equal exactly zero? For example, given the set { −7, −3 … Wikipedia
One-way function — Unsolved problems in computer science Do one way functions exist? In computer science, a one way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here easy and hard are to be… … Wikipedia
Probleme de la somme de sous-ensembles — Problème de la somme de sous ensembles Le problème de la somme de sous ensembles aussi noté SSP (de l anglais Subset Sum Problem) est un problème important en complexité algorithmique et en cryptologie. Le problème est le suivant : étant… … Wikipédia en Français
